________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        05.02.2010 02:28:07
Input Data from:  dataset236.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :40
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,158416666666667
Average f[i]   :5062,5
Average g[i,j] :1976,31578947368
Total demand   :16070
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 39
> Selected Move:	3630	1	-1	23	4000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 3630


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 149
> Selected Move:	4690	1	-1	2	8000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 4690


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 113
> Selected Move:	5940	1	-1	5	14000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 5940


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 112
> Selected Move:	7450	1	-1	6	20500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 7450


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 206
> Selected Move:	9060	1	-1	38	25000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0    >new incumb.: 9060


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 106
> Selected Move:	9250	3	23	33	25000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0    >new incumb.: 9250


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 93
> Selected Move:	9590	3	6	8	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0    >new incumb.: 9590


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 107
> Selected Move:	9868	3	0	18	26600


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 42
> Selected Move:	10660	4	18	8	24900


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  2  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0    >new incumb.: 10660


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 98
> Selected Move:	10840	3	5	34	24400


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0    >new incumb.: 10840


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 43
> Selected Move:	11030	3	2	14	24900


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  2  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0    >new incumb.: 11030


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 77
> Selected Move:	10942	3	8	17	25100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  2  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 52
> Selected Move:	10990	4	17	14	24200


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 71
> Selected Move:	10990	4	14	18	24100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 68
> Selected Move:	10990	4	18	34	23800


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  2  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 75
> Selected Move:	10990	4	34	38	24100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 76
> Selected Move:	10945	4	38	33	25100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 93
> Selected Move:	10720	3	33	3	25000


> New Y[]: 
	
	 0  3  0  2  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 106
> Selected Move:	10580	3	3	23	24500


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 84
> Selected Move:	10580	4	23	14	24200


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  2  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 93
> Selected Move:	10580	4	14	18	24100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  2  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 92
> Selected Move:	10618	3	34	9	25100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  2  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 197
> Selected Move:	10778	3	23	33	25100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 166
> Selected Move:	10820	4	18	9	23600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 196
> Selected Move:	10810	3	9	5	23400


> New Y[]: 
	
	 0  3  0  0  0  2  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 146
> Selected Move:	10810	4	5	14	24700


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  0  0  0  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 119
> Selected Move:	10810	4	14	18	24600


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 121
> Selected Move:	10810	4	18	38	24600


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 125
> Selected Move:	10781	3	5	9	25100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 173
> Selected Move:	10743	4	38	14	25200


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  0  2  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 190
> Selected Move:	10584	3	33	23	25200


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  0  0  0  2  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 31 #######################


> Neighbours evaluated; 197
> Selected Move:	10660	4	14	9	23600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  0  0  1  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 32 #######################


> Neighbours evaluated; 218
> Selected Move:	10690	3	17	20	24100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 33 #######################


> Neighbours evaluated; 231
> Selected Move:	10690	3	23	33	24100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  2  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 34 #######################


> Neighbours evaluated; 209
> Selected Move:	10860	3	9	34	24300


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  2  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,365

## ITERATION 35 #######################


> Neighbours evaluated; 78
> Selected Move:	10860	4	34	14	24700


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,36

## ITERATION 36 #######################


> Neighbours evaluated; 74
> Selected Move:	10860	4	14	18	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  2  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,355

## ITERATION 37 #######################


> Neighbours evaluated; 72
> Selected Move:	10860	4	18	20	24700


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  2  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,35

## ITERATION 38 #######################


> Neighbours evaluated; 73
> Selected Move:	10860	4	20	38	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,345

## ITERATION 39 #######################


> Neighbours evaluated; 89
> Selected Move:	10653	4	38	33	25600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  2  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,34

## ITERATION 40 #######################


> Neighbours evaluated; 100
> Selected Move:	10566	3	20	2	25100


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 
 > pw :0,335

## ITERATION 41 #######################


> Neighbours evaluated; 59
> Selected Move:	10600	4	33	2	24600


> New Y[]: 
	
	 0  3  2  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 
 > pw :0,33

## ITERATION 42 #######################


> Neighbours evaluated; 58
> Selected Move:	10690	3	2	6	24700


> New Y[]: 
	
	 0  3  0  0  0  0  2  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 43 #######################


> Neighbours evaluated; 105
> Selected Move:	10650	3	6	16	24800


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  2  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 44 #######################


> Neighbours evaluated; 83
> Selected Move:	10650	4	16	14	24700


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 45 #######################


> Neighbours evaluated; 84
> Selected Move:	10650	4	14	18	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 46 #######################


> Neighbours evaluated; 88
> Selected Move:	10650	4	18	34	24300


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  2  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 47 #######################


> Neighbours evaluated; 89
> Selected Move:	10650	4	34	38	24600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 48 #######################


> Neighbours evaluated; 91
> Selected Move:	10600	3	16	2	24100


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 
 > pw :0,295

## ITERATION 49 #######################


> Neighbours evaluated; 61
> Selected Move:	10771	3	14	11	25100


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 50 #######################


> Neighbours evaluated; 91
> Selected Move:	10800	4	38	11	24700


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 51 #######################


> Neighbours evaluated; 96
> Selected Move:	10800	4	11	34	24800


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  2  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 52 #######################


> Neighbours evaluated; 95
> Selected Move:	10772	4	34	18	25100


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 53 #######################


> Neighbours evaluated; 93
> Selected Move:	10700	3	11	25	24600


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 54 #######################


> Neighbours evaluated; 104
> Selected Move:	10700	4	18	25	24600


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  2  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 55 #######################


> Neighbours evaluated; 104
> Selected Move:	10700	4	25	34	24300


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  2  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 56 #######################


> Neighbours evaluated; 106
> Selected Move:	10700	4	34	38	24600


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 57 #######################


> Neighbours evaluated; 104
> Selected Move:	10675	4	38	2	25100


> New Y[]: 
	
	 0  3  2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 58 #######################


> Neighbours evaluated; 104
> Selected Move:	10650	3	25	11	25600


> New Y[]: 
	
	 0  3  2  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 59 #######################


> Neighbours evaluated; 99
> Selected Move:	10531	4	2	33	26100


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 60 #######################


> Neighbours evaluated; 109
> Selected Move:	10556	3	11	25	25600


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  2  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 61 #######################


> Neighbours evaluated; 127
> Selected Move:	10430	3	33	23	25000


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  2  0  1  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,25

## ITERATION 62 #######################


> Neighbours evaluated; 112
> Selected Move:	10475	3	2	20	25500


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  2  0  1  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,255

## ITERATION 63 #######################


> Neighbours evaluated; 103
> Selected Move:	10600	4	23	34	24800


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  1  0  0  0  0  0  0  0  0  2  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,26

## ITERATION 64 #######################


> Neighbours evaluated; 120
> Selected Move:	10630	3	23	33	24800


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  2  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 65 #######################


> Neighbours evaluated; 120
> Selected Move:	10604	4	34	18	25100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 66 #######################


> Neighbours evaluated; 112
> Selected Move:	10603	4	18	25	25100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  2  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 67 #######################


> Neighbours evaluated; 109
> Selected Move:	10740	3	25	36	24900


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,28

## ITERATION 68 #######################


> Neighbours evaluated; 140
> Selected Move:	10698	3	33	26	25400


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,285

## ITERATION 69 #######################


> Neighbours evaluated; 114
> Selected Move:	10750	3	20	17	24900


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 
 > pw :0,29

## ITERATION 70 #######################


> Neighbours evaluated; 88
> Selected Move:	10664	3	26	4	25400


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 
 > pw :0,295

## ITERATION 71 #######################


> Neighbours evaluated; 87
> Selected Move:	10665	3	17	20	25900


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 
 > pw :0,3

## ITERATION 72 #######################


> Neighbours evaluated; 140
> Selected Move:	10450	3	20	11	26900


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,305

## ITERATION 73 #######################


> Neighbours evaluated; 133
> Selected Move:	10466	3	4	33	25900


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,31

## ITERATION 74 #######################


> Neighbours evaluated; 132
> Selected Move:	10640	3	11	17	24400


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 
 > pw :0,315

## ITERATION 75 #######################


> Neighbours evaluated; 94
> Selected Move:	10614	3	17	25	25400


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  1  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,32

## ITERATION 76 #######################


> Neighbours evaluated; 152
> Selected Move:	10592	1	-1	17	29400


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  1  0  2  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,325

## ITERATION 77 #######################


> Neighbours evaluated; 139
> Selected Move:	10608	3	36	0	27500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,33

## ITERATION 78 #######################


> Neighbours evaluated; 97
> Selected Move:	10480	3	25	14	27000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 
 > pw :0,335

## ITERATION 79 #######################


> Neighbours evaluated; 33
> Selected Move:	10930	4	1	14	24700


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,34

## ITERATION 80 #######################


> Neighbours evaluated; 71
> Selected Move:	10930	4	14	17	24600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,345

## ITERATION 81 #######################


> Neighbours evaluated; 64
> Selected Move:	11020	3	17	6	24600


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,35

## ITERATION 82 #######################


> Neighbours evaluated; 73
> Selected Move:	10975	3	34	5	25100


> New Y[]: 
	
	 2  0  0  0  0  1  3  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,355

## ITERATION 83 #######################


> Neighbours evaluated; 89
> Selected Move:	10895	3	6	17	25100


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 84 #######################


> Neighbours evaluated; 80
> Selected Move:	10930	4	17	5	23700


> New Y[]: 
	
	 2  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 85 #######################


> Neighbours evaluated; 110
> Selected Move:	10930	4	5	38	24600


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 86 #######################


> Neighbours evaluated; 95
> Selected Move:	10930	3	5	34	24100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,365

## ITERATION 87 #######################


> Neighbours evaluated; 80
> Selected Move:	10930	4	38	18	24900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,36

## ITERATION 88 #######################


> Neighbours evaluated; 57
> Selected Move:	10930	4	18	34	23400


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,355

## ITERATION 89 #######################


> Neighbours evaluated; 93
> Selected Move:	10930	3	33	23	23400


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,35

## ITERATION 90 #######################


> Neighbours evaluated; 94
> Selected Move:	10930	4	34	14	24700


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,345

## ITERATION 91 #######################


> Neighbours evaluated; 57
> Selected Move:	10930	4	14	17	24600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  3  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,34

## ITERATION 92 #######################


> Neighbours evaluated; 56
> Selected Move:	10930	4	17	18	24900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  3  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,335

## ITERATION 93 #######################


> Neighbours evaluated; 52
> Selected Move:	10930	4	18	23	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  3  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,33

## ITERATION 94 #######################


> Neighbours evaluated; 55
> Selected Move:	10930	4	23	38	24100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,325

## ITERATION 95 #######################


> Neighbours evaluated; 111
> Selected Move:	10930	3	34	5	24600


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 96 #######################


> Neighbours evaluated; 105
> Selected Move:	10930	4	38	5	23700


> New Y[]: 
	
	 2  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 97 #######################


> Neighbours evaluated; 139
> Selected Move:	10899	4	5	17	25100


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  3  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 98 #######################


> Neighbours evaluated; 101
> Selected Move:	10868	4	17	14	25200


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  3  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 99 #######################


> Neighbours evaluated; 107
> Selected Move:	10869	3	23	33	25200


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  3  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 100 #######################


> Neighbours evaluated; 95
> Selected Move:	10810	4	14	18	25400


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 101 #######################


> Neighbours evaluated; 99
> Selected Move:	10812	3	33	23	25400


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  3  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 102 #######################


> Neighbours evaluated; 86
> Selected Move:	10840	4	18	23	25300


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 103 #######################


> Neighbours evaluated; 132
> Selected Move:	10686	3	23	33	25800


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 104 #######################


> Neighbours evaluated; 89
> Selected Move:	10837	3	5	34	25300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  3  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,315

## ITERATION 105 #######################


> Neighbours evaluated; 97
> Selected Move:	10697	3	33	3	25200


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 106 #######################


> Neighbours evaluated; 121
> Selected Move:	10530	3	3	24	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 107 #######################


> Neighbours evaluated; 95
> Selected Move:	10530	4	24	34	24900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  3  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 108 #######################


> Neighbours evaluated; 111
> Selected Move:	10647	3	34	9	25100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  3  0  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 109 #######################


> Neighbours evaluated; 191
> Selected Move:	10820	3	24	23	23600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  3  0  0  0  0  1  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 110 #######################


> Neighbours evaluated; 187
> Selected Move:	10820	3	23	33	23600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  3  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 111 #######################


> Neighbours evaluated; 151
> Selected Move:	10930	3	9	30	23500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 112 #######################


> Neighbours evaluated; 108
> Selected Move:	10895	4	30	38	25100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 113 #######################


> Neighbours evaluated; 83
> Selected Move:	10785	3	30	9	25100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 114 #######################


> Neighbours evaluated; 144
> Selected Move:	10784	3	33	23	25100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 115 #######################


> Neighbours evaluated; 180
> Selected Move:	10601	4	38	17	25600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  3  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 116 #######################


> Neighbours evaluated; 170
> Selected Move:	10598	3	23	33	25600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 117 #######################


> Neighbours evaluated; 124
> Selected Move:	10705	3	9	30	25600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 118 #######################


> Neighbours evaluated; 66
> Selected Move:	10664	4	17	14	25700


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 119 #######################


> Neighbours evaluated; 74
> Selected Move:	10584	4	14	18	25900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  3  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 120 #######################


> Neighbours evaluated; 75
> Selected Move:	10583	3	18	35	25300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  3  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,395

## ITERATION 121 #######################


> Neighbours evaluated; 45
> Selected Move:	10700	4	35	30	25000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,4

## ITERATION 122 #######################


> Neighbours evaluated; 90
> Selected Move:	10650	3	35	31	25000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  3  1  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 123 #######################


> Neighbours evaluated; 76
> Selected Move:	10569	4	30	31	25200


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  3  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 124 #######################


> Neighbours evaluated; 109
> Selected Move:	10338	3	33	23	25200


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  3  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 125 #######################


> Neighbours evaluated; 51
> Selected Move:	10420	4	31	30	25000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  3  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 126 #######################


> Neighbours evaluated; 84
> Selected Move:	10620	3	31	18	23500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  3  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 127 #######################


> Neighbours evaluated; 121
> Selected Move:	10578	4	30	38	25100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,43

## ITERATION 128 #######################


> Neighbours evaluated; 90
> Selected Move:	10362	4	38	17	25600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  3  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,435

## ITERATION 129 #######################


> Neighbours evaluated; 80
> Selected Move:	10316	4	17	14	25700


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,44

## ITERATION 130 #######################


> Neighbours evaluated; 72
> Selected Move:	10512	3	30	9	25700


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 131 #######################


> Neighbours evaluated; 159
> Selected Move:	10509	3	23	33	25700


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 132 #######################


> Neighbours evaluated; 134
> Selected Move:	10415	4	14	18	25900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 133 #######################


> Neighbours evaluated; 137
> Selected Move:	10411	3	33	23	25900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  3  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 134 #######################


> Neighbours evaluated; 151
> Selected Move:	10452	4	18	23	25800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  1  0  0  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 135 #######################


> Neighbours evaluated; 177
> Selected Move:	10308	3	23	24	25800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  1  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 136 #######################


> Neighbours evaluated; 167
> Selected Move:	10339	3	9	5	25300


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 137 #######################


> Neighbours evaluated; 110
> Selected Move:	10385	4	24	5	25200


> New Y[]: 
	
	 2  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 138 #######################


> Neighbours evaluated; 134
> Selected Move:	10190	3	5	26	24500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 139 #######################


> Neighbours evaluated; 127
> Selected Move:	10190	4	26	24	23800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  3  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 140 #######################


> Neighbours evaluated; 149
> Selected Move:	10320	3	24	32	24200


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  1  0  0  0  0  0  3  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 141 #######################


> Neighbours evaluated; 99
> Selected Move:	10500	3	26	33	23700


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  3  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 142 #######################


> Neighbours evaluated; 86
> Selected Move:	10470	3	33	4	24700


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 143 #######################


> Neighbours evaluated; 106
> Selected Move:	10470	3	32	30	24500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 144 #######################


> Neighbours evaluated; 121
> Selected Move:	10340	3	17	16	25000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 145 #######################


> Neighbours evaluated; 59
> Selected Move:	10640	3	4	33	24000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  3  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,49

## ITERATION 146 #######################


> Neighbours evaluated; 106
> Selected Move:	10800	3	16	20	24000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  3  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 147 #######################


> Neighbours evaluated; 119
> Selected Move:	10800	3	30	5	24200


> New Y[]: 
	
	 2  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 148 #######################


> Neighbours evaluated; 99
> Selected Move:	10800	3	5	34	23900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,475

## ITERATION 149 #######################


> Neighbours evaluated; 79
> Selected Move:	10800	4	34	20	24700


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,47

## ITERATION 150 #######################


> Neighbours evaluated; 57
> Selected Move:	10930	3	20	8	24900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,465

## ITERATION 151 #######################


> Neighbours evaluated; 61
> Selected Move:	11000	3	14	2	24400


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 152 #######################


> Neighbours evaluated; 69
> Selected Move:	10900	3	34	5	24900


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 153 #######################


> Neighbours evaluated; 85
> Selected Move:	10748	3	2	14	25400


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  3  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 154 #######################


> Neighbours evaluated; 90
> Selected Move:	10750	3	33	23	25400


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  3  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 155 #######################


> Neighbours evaluated; 88
> Selected Move:	10930	3	5	34	24900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 156 #######################


> Neighbours evaluated; 70
> Selected Move:	10800	3	8	20	24700


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 157 #######################


> Neighbours evaluated; 58
> Selected Move:	10800	4	20	34	23900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,43

## ITERATION 158 #######################


> Neighbours evaluated; 81
> Selected Move:	10800	4	34	38	24600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,425

## ITERATION 159 #######################


> Neighbours evaluated; 70
> Selected Move:	10800	3	23	33	24600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,42

## ITERATION 160 #######################


> Neighbours evaluated; 75
> Selected Move:	10800	3	20	16	24600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,415

## ITERATION 161 #######################


> Neighbours evaluated; 66
> Selected Move:	10800	4	38	16	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,41

## ITERATION 162 #######################


> Neighbours evaluated; 57
> Selected Move:	10800	4	16	34	23900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,405

## ITERATION 163 #######################


> Neighbours evaluated; 84
> Selected Move:	10800	3	34	5	24200


> New Y[]: 
	
	 2  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 164 #######################


> Neighbours evaluated; 97
> Selected Move:	10760	4	5	38	25100


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 165 #######################


> Neighbours evaluated; 80
> Selected Move:	10761	3	16	20	25100


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 166 #######################


> Neighbours evaluated; 103
> Selected Move:	10761	3	33	23	25100


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 167 #######################


> Neighbours evaluated; 111
> Selected Move:	10800	4	38	5	24200


> New Y[]: 
	
	 2  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 168 #######################


> Neighbours evaluated; 145
> Selected Move:	10724	4	5	20	25200


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  1  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 169 #######################


> Neighbours evaluated; 126
> Selected Move:	10725	3	23	33	25200


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 170 #######################


> Neighbours evaluated; 102
> Selected Move:	10686	3	20	16	25300


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 171 #######################


> Neighbours evaluated; 89
> Selected Move:	10531	4	16	14	25700


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  0  3  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 172 #######################


> Neighbours evaluated; 55
> Selected Move:	10722	3	5	34	25200


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,395

## ITERATION 173 #######################


> Neighbours evaluated; 56
> Selected Move:	10721	3	16	20	25200


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,4

## ITERATION 174 #######################


> Neighbours evaluated; 69
> Selected Move:	10720	3	33	23	25200


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,405

## ITERATION 175 #######################


> Neighbours evaluated; 58
> Selected Move:	10679	4	14	23	25300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  3  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,41

## ITERATION 176 #######################


> Neighbours evaluated; 64
> Selected Move:	10636	4	23	18	25400


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  3  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,415

## ITERATION 177 #######################


> Neighbours evaluated; 87
> Selected Move:	10634	3	23	33	25400


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,42

## ITERATION 178 #######################


> Neighbours evaluated; 63
> Selected Move:	10632	3	20	16	25400


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,425

## ITERATION 179 #######################


> Neighbours evaluated; 61
> Selected Move:	10570	3	33	23	25400


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  3  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,43

## ITERATION 180 #######################


> Neighbours evaluated; 37
> Selected Move:	10740	4	18	16	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  3  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,435

## ITERATION 181 #######################


> Neighbours evaluated; 50
> Selected Move:	10780	3	16	6	24600


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,44

## ITERATION 182 #######################


> Neighbours evaluated; 94
> Selected Move:	10556	3	34	5	25100


> New Y[]: 
	
	 2  0  0  0  0  1  3  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,445

## ITERATION 183 #######################


> Neighbours evaluated; 126
> Selected Move:	10453	3	5	9	25600


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 184 #######################


> Neighbours evaluated; 172
> Selected Move:	10450	3	23	33	25600


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 185 #######################


> Neighbours evaluated; 142
> Selected Move:	10411	3	6	8	25900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 186 #######################


> Neighbours evaluated; 132
> Selected Move:	10516	3	9	30	25900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 187 #######################


> Neighbours evaluated; 81
> Selected Move:	10474	3	8	20	25700


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 188 #######################


> Neighbours evaluated; 68
> Selected Move:	10518	4	20	38	25600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 189 #######################


> Neighbours evaluated; 85
> Selected Move:	10405	3	30	9	25600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 190 #######################


> Neighbours evaluated; 124
> Selected Move:	10690	4	38	9	24100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  3  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 191 #######################


> Neighbours evaluated; 184
> Selected Move:	10690	3	33	23	24100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  3  0  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 192 #######################


> Neighbours evaluated; 199
> Selected Move:	10680	3	20	16	24100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  3  0  0  0  0  1  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 193 #######################


> Neighbours evaluated; 164
> Selected Move:	10740	3	9	34	23900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 194 #######################


> Neighbours evaluated; 74
> Selected Move:	10740	4	34	38	24600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,505

## ITERATION 195 #######################


> Neighbours evaluated; 69
> Selected Move:	10639	4	38	14	25200


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  3  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,51

## ITERATION 196 #######################


> Neighbours evaluated; 48
> Selected Move:	10587	4	14	23	25300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  3  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,515

## ITERATION 197 #######################


> Neighbours evaluated; 88
> Selected Move:	10390	3	16	2	24800


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  3  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,51

## ITERATION 198 #######################


> Neighbours evaluated; 49
> Selected Move:	10527	3	14	25	25300


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  3  0  1  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,505

## ITERATION 199 #######################


> Neighbours evaluated; 66
> Selected Move:	10680	4	23	25	24800


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 200 #######################


> Neighbours evaluated; 80
> Selected Move:	10740	3	25	8	24400


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,495

## ITERATION 201 #######################


> Neighbours evaluated; 78
> Selected Move:	10740	3	8	11	24900


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,49

## ITERATION 202 #######################


> Neighbours evaluated; 81
> Selected Move:	10800	3	23	33	24900


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 203 #######################


> Neighbours evaluated; 83
> Selected Move:	10800	4	11	34	24400


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  3  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 204 #######################


> Neighbours evaluated; 99
> Selected Move:	10808	3	11	8	25400


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  3  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 205 #######################


> Neighbours evaluated; 59
> Selected Move:	10680	3	8	25	23900


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,47

## ITERATION 206 #######################


> Neighbours evaluated; 119
> Selected Move:	10890	3	38	28	24900


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  1  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,465

## ITERATION 207 #######################


> Neighbours evaluated; 81
> Selected Move:	10797	4	34	28	25200


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  3  0  0  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,46

## ITERATION 208 #######################


> Neighbours evaluated; 80
> Selected Move:	10680	3	28	38	24600


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,455

## ITERATION 209 #######################


> Neighbours evaluated; 99
> Selected Move:	10755	3	25	11	25100


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 210 #######################


> Neighbours evaluated; 85
> Selected Move:	10725	3	2	21	25100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445
________________________________________________________________

Best solution found: 11030
Run Termination time: 05.02.2010 02:37:20
Run duration: 00:09:12.3906250
________________________________________________________________
